Multiterminal Secret Key Agreement at Asymptotically Zero Discussion Rate
نویسندگان
چکیده
In the multiterminal secret key agreement problem, a set of users want to discuss with each other until they share a common secret key independent of their discussion. We want to characterize the maximum secret key rate, called the secrecy capacity, asymptotically when the total discussion rate goes to zero. In the case of only two users, the capacity is equal to the Gács–Körner common information. However, when there are more than two users, the capacity is unknown. It is plausible that a multivariate extension of the Gács-Körner common information is the capacity, however, proving the converse is challenging. We resolved this for the hypergraphical sources and finite linear sources, and provide efficiently computable characterizations. We also give some ideas of extending the techniques to more general source models.
منابع مشابه
Compressed Secret Key Agreement: Maximizing Multivariate Mutual Information per Bit
The multiterminal secret key agreement problem by public discussion is formulated with an additional source compression step where, prior to the public discussion phase, users independently compress their private sources to filter out strongly correlated components in order to generate a common secret key. The objective is to maximize the achievable key rate as a function of the joint entropy o...
متن کاملMultiterminal Secrecy by Public Discussion
This monograph describes principles of information theoretic secrecy generation by legitimate parties with public discussion in the presence of an eavesdropper. The parties are guaranteed secrecy in the form of independence from the eavesdropper’s observation of the communication. Part I develops basic technical tools for secrecy generation, many of which are potentially of independent interest...
متن کاملInformation-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio
Information-theoretically secure secret-key agreement between two parties Alice and Bob is a well-studied problem that is provably impossible in a plain model with public (authenticated) communication, but is known to be possible in a model where the parties also have access to some correlated randomness. One particular type of such correlated randomness is the so-called satellite setting, wher...
متن کاملInformation Theoretic Secret Key Generation: Structured codes and Tree Packing
Title of dissertation: INFORMATION THEORETIC SECRET KEY GENERATION: STRUCTURED CODES AND TREE PACKING Sirin Nitinawarat, Doctor of Philosophy, 2010 Dissertation directed by: Professor Prakash Narayan Department of Electrical and Computer Engineering Institute for Systems Research This dissertation deals with a multiterminal source model for secret key generation by multiple network terminals wi...
متن کاملTitle of dissertation : INFORMATION THEORETIC GENERATION OF MULTIPLE SECRET KEYS
Title of dissertation: INFORMATION THEORETIC GENERATION OF MULTIPLE SECRET KEYS Chunxuan Ye, Doctor of Philosophy, 2005 Dissertation directed by: Professor Prakash Narayan Department of Electrical and Computer Engineering and Institute for System Research This dissertation studies the problem of secret key generation for encrypted group communication in a network, based on an information theore...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1802.04955 شماره
صفحات -
تاریخ انتشار 2018